Generalized Yosida Approximations Based on RelativelyA-Maximalm-Relaxed Monotonicity Frameworks
نویسندگان
چکیده
منابع مشابه
Relaxed Proximal Point Algorithms Based on A−maximal Relaxed Monotonicity Frameworks with Applications
Based on the A−maximal (m)−relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak conver...
متن کاملGeneralized Equilibrium Problem with Mixed Relaxed Monotonicity
We extend the concept of relaxed α-monotonicity to mixed relaxed α-β-monotonicity. The concept of mixed relaxed α-β-monotonicity is more general than many existing concepts of monotonicities. Finally, we apply this concept and well known KKM-theory to obtain the solution of generalized equilibrium problem.
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملGeneralized Mixed Equilibrium Problems with Extended Relaxed - monotonicity
In this paper, we introduce the notion of extended relaxed -monotonicity. We obtain existence solution of the generalized mixed equilibrium problems in reflexive Banach spaces with extended relaxed -monotonicity by using the KKM technique. Our results extend and improve the corresponding results in the existing literature.
متن کاملExpanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of the extensions of an argumentation framework if we extend it (new information) and/or change the underlying semantics (change of proof standards). We show both possibility and impossibility results related to the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/157190